Paul Bonsma: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

[ACM Press the first international joint conference - Bologna, Italy (2002.07.15-2002.07.19)] Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 2 - AAMAS '02 - Core specification and experiments in DIET

Hoile, Cefn, Wang, Fang, Bonsma, Erwin, Marrow, Paul

Year:

2002

Language:

english

File:

PDF, 237 KB

english, 2002

2

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Christoph Berkholz,Paul Bonsma,Martin Grohe

Journal:

Theory of Computing Systems

Year:

2017

Language:

english

File:

PDF, 1.74 MB

english, 2017

3

The complexity of the matching-cut problem for planar graphs and other graph classes

Journal:

Journal of Graph Theory

Year:

2009

Language:

english

File:

PDF, 247 KB

english, 2009

4

Extremal graphs having no matching cuts

Paul Bonsma, Arthur M. Farley, Andrzej Proskurowski

Journal:

Journal of Graph Theory

Year:

2012

Language:

english

File:

PDF, 172 KB

english, 2012

5

Most balanced minimum cuts

Journal:

Discrete Applied Mathematics

Year:

2010

Language:

english

File:

PDF, 1.47 MB

english, 2010

6

Linear time algorithms for finding sparsest cuts in various graph classes

Journal:

Electronic Notes in Discrete Mathematics

Year:

2007

Language:

english

File:

PDF, 227 KB

english, 2007

7

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances

Paul Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson

Journal:

Electronic Notes in Discrete Mathematics

Year:

2007

Language:

english

File:

PDF, 208 KB

english, 2007

8

Edge-cuts leaving components of order at least three

Paul Bonsma, Nicola Ueffing, Lutz Volkmann

Journal:

Discrete Mathematics

Year:

2002

Language:

english

File:

PDF, 117 KB

english, 2002

9

Sparsest cuts and concurrent flows in product graphs

Journal:

Discrete Applied Mathematics

Year:

2004

Language:

english

File:

PDF, 300 KB

english, 2004

10

Counting Hexagonal Patches and Independent Sets in Circle Graphs

Paul Bonsma, Felix Breuer

Journal:

Year:

2012

Language:

english

File:

PDF, 912 KB

english, 2012

11

Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances

Paul Bonsma, Luis Cereceda

Journal:

Theoretical Computer Science

Year:

2009

Language:

english

File:

PDF, 844 KB

english, 2009

12

The Complexity of the Matching-cut Problem for Various Graph Classes

Journal:

Electronic Notes in Discrete Mathematics

Year:

2003

File:

PDF, 228 KB

2003

13

Improved bounds for spanning trees with many leaves

Paul Bonsma, Florian Zickfeld

Journal:

Discrete Mathematics

Year:

2012

Language:

english

File:

PDF, 530 KB

english, 2012

14

Max-leaves spanning tree is APX-hard for cubic graphs

Journal:

Journal of Discrete Algorithms

Year:

2012

Language:

english

File:

PDF, 267 KB

english, 2012

15

The complexity of finding uniform sparsest cuts in various graph classes

Paul Bonsma, Hajo Broersma, Viresh Patel, Artem Pyatkin

Journal:

Journal of Discrete Algorithms

Year:

2012

Language:

english

File:

PDF, 293 KB

english, 2012

16

A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

Bonsma, Paul, Zickfeld, Florian

Journal:

SIAM Journal on Discrete Mathematics

Year:

2011

Language:

english

File:

PDF, 231 KB

english, 2011

17

Spanning Trees with Many Leaves in Graphs With Minimum Degree Three

Bonsma, Paul S.

Journal:

SIAM Journal on Discrete Mathematics

Year:

2008

Language:

english

File:

PDF, 222 KB

english, 2008

18

The complexity of rerouting shortest paths

Journal:

Theoretical Computer Science

Year:

2013

Language:

english

File:

PDF, 363 KB

english, 2013

19

A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths

Bonsma, Paul, Schulz, Jens, Wiese, Andreas

Journal:

SIAM Journal on Computing

Year:

2014

Language:

english

File:

PDF, 459 KB

english, 2014

20

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

Bonsma, Paul, Schulz, Jens, Wiese, Andreas

Year:

2011

Language:

english

File:

PDF, 585 KB

english, 2011

21

Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree

Bonsma, Paul, Dorn, Frederic

Journal:

ACM Transactions on Algorithms

Year:

2011

Language:

english

File:

PDF, 348 KB

english, 2011

22

A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves

Solis-Oba, Roberto, Bonsma, Paul, Lowski, Stefanie

Journal:

Year:

2017

Language:

english

File:

PDF, 568 KB

english, 2017

23

Independent Set Reconfiguration in Cographs and their Generalizations

Journal:

Journal of Graph Theory

Year:

2015

Language:

english

File:

PDF, 442 KB

english, 2015

24

Rerouting shortest paths in planar graphs

Journal:

Discrete Applied Mathematics

Year:

2016

Language:

english

File:

PDF, 628 KB

english, 2016

25

Using contracted solution graphs for solving reconfiguration problems

Bonsma, Paul, Paulusma, Daniël

Journal:

Acta Informatica

Year:

2019

Language:

english

File:

PDF, 710 KB

english, 2019